./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '1c93cc267f3fa9111282ae2218d996ece9eec8d2b16bef9815b7e16fff94a7e6'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c93cc267f3fa9111282ae2218d996ece9eec8d2b16bef9815b7e16fff94a7e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:44:26,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:44:26,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:44:26,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:44:26,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:44:26,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:44:26,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:44:26,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:44:26,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:44:26,943 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:44:26,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:44:26,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:44:26,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:44:26,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:44:26,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:44:26,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:44:26,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:44:26,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:44:26,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:44:26,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:44:26,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:44:26,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:44:26,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:44:26,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:44:26,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:44:26,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:44:26,947 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c93cc267f3fa9111282ae2218d996ece9eec8d2b16bef9815b7e16fff94a7e6 [2024-11-07 10:44:27,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:44:27,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:44:27,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:44:27,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:44:27,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:44:27,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i [2024-11-07 10:44:28,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:44:28,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:44:28,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i [2024-11-07 10:44:28,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec6ada049/f5482059952146f8a4b2ac64cad3cddc/FLAG4a06a5abf [2024-11-07 10:44:28,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec6ada049/f5482059952146f8a4b2ac64cad3cddc [2024-11-07 10:44:28,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:44:28,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:44:28,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:44:28,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:44:28,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:44:28,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:28" (1/1) ... [2024-11-07 10:44:28,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e83980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:28, skipping insertion in model container [2024-11-07 10:44:28,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:28" (1/1) ... [2024-11-07 10:44:28,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:44:28,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i[916,929] [2024-11-07 10:44:28,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:44:28,967 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:44:28,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i[916,929] [2024-11-07 10:44:29,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:44:29,041 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:44:29,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29 WrapperNode [2024-11-07 10:44:29,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:44:29,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:44:29,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:44:29,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:44:29,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,124 INFO L138 Inliner]: procedures = 30, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 600 [2024-11-07 10:44:29,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:44:29,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:44:29,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:44:29,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:44:29,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,162 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:44:29,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:44:29,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:44:29,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:44:29,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:44:29,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (1/1) ... [2024-11-07 10:44:29,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:44:29,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:44:29,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:44:29,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:44:29,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:44:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:44:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:44:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:44:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:44:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:44:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:44:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:44:29,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:44:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:44:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:44:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:44:29,425 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:44:29,427 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:44:30,014 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-07 10:44:30,015 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:44:30,029 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:44:30,029 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:44:30,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:30 BoogieIcfgContainer [2024-11-07 10:44:30,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:44:30,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:44:30,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:44:30,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:44:30,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:44:28" (1/3) ... [2024-11-07 10:44:30,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ea58de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:30, skipping insertion in model container [2024-11-07 10:44:30,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:29" (2/3) ... [2024-11-07 10:44:30,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ea58de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:30, skipping insertion in model container [2024-11-07 10:44:30,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:30" (3/3) ... [2024-11-07 10:44:30,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-39.i [2024-11-07 10:44:30,057 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:44:30,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:44:30,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:44:30,124 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;@2557f483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:44:30,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:44:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:44:30,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:30,142 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:30,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:30,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 276579875, now seen corresponding path program 1 times [2024-11-07 10:44:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218613992] [2024-11-07 10:44:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:30,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218613992] [2024-11-07 10:44:30,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218613992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:30,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:30,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:44:30,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344024762] [2024-11-07 10:44:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:30,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:44:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:30,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:44:30,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:44:30,623 INFO L87 Difference]: Start difference. First operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:44:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:30,655 INFO L93 Difference]: Finished difference Result 233 states and 364 transitions. [2024-11-07 10:44:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:44:30,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-07 10:44:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:30,662 INFO L225 Difference]: With dead ends: 233 [2024-11-07 10:44:30,662 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 10:44:30,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:44:30,668 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:30,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:44:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 10:44:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-07 10:44:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-07 10:44:30,712 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2024-11-07 10:44:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:30,712 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-07 10:44:30,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:44:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-07 10:44:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:44:30,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:30,716 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:30,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:44:30,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:30,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:30,717 INFO L85 PathProgramCache]: Analyzing trace with hash 534061159, now seen corresponding path program 1 times [2024-11-07 10:44:30,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514068404] [2024-11-07 10:44:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:31,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:31,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514068404] [2024-11-07 10:44:31,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514068404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:31,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:44:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085944668] [2024-11-07 10:44:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:31,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:44:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:31,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:44:31,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:44:31,162 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:44:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:31,222 INFO L93 Difference]: Finished difference Result 231 states and 340 transitions. [2024-11-07 10:44:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:44:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-07 10:44:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:31,224 INFO L225 Difference]: With dead ends: 231 [2024-11-07 10:44:31,224 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 10:44:31,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-11-07 10:44:31,227 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:31,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:44:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 10:44:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-07 10:44:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-07 10:44:31,248 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 128 [2024-11-07 10:44:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:31,249 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-07 10:44:31,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:44:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-07 10:44:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:44:31,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:31,254 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:31,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:44:31,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:31,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:31,255 INFO L85 PathProgramCache]: Analyzing trace with hash -726856091, now seen corresponding path program 1 times [2024-11-07 10:44:31,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:31,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81352776] [2024-11-07 10:44:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:33,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:33,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81352776] [2024-11-07 10:44:33,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81352776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:33,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:33,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570386984] [2024-11-07 10:44:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:33,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:33,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:33,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:33,249 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:33,747 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2024-11-07 10:44:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:44:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:33,750 INFO L225 Difference]: With dead ends: 305 [2024-11-07 10:44:33,752 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 10:44:33,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-11-07 10:44:33,753 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 92 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:33,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 335 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:44:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 10:44:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-07 10:44:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 164 states have (on average 1.420731707317073) internal successors, (233), 165 states have internal predecessors, (233), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:44:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 273 transitions. [2024-11-07 10:44:33,781 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 273 transitions. Word has length 128 [2024-11-07 10:44:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:33,781 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 273 transitions. [2024-11-07 10:44:33,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 273 transitions. [2024-11-07 10:44:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:44:33,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:33,783 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:33,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:44:33,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:33,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1406914461, now seen corresponding path program 1 times [2024-11-07 10:44:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:33,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023496415] [2024-11-07 10:44:33,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023496415] [2024-11-07 10:44:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023496415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 10:44:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960620954] [2024-11-07 10:44:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:37,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:44:37,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:37,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:44:37,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:44:37,798 INFO L87 Difference]: Start difference. First operand 187 states and 273 transitions. Second operand has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-07 10:44:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:40,108 INFO L93 Difference]: Finished difference Result 468 states and 681 transitions. [2024-11-07 10:44:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 10:44:40,110 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 128 [2024-11-07 10:44:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:40,113 INFO L225 Difference]: With dead ends: 468 [2024-11-07 10:44:40,114 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 10:44:40,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:44:40,115 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 299 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:40,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1634 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 10:44:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 10:44:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 195. [2024-11-07 10:44:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 173 states have internal predecessors, (243), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:44:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2024-11-07 10:44:40,143 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 128 [2024-11-07 10:44:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:40,145 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2024-11-07 10:44:40,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-07 10:44:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2024-11-07 10:44:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:44:40,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:40,149 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:40,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:44:40,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:40,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1979763303, now seen corresponding path program 1 times [2024-11-07 10:44:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582076142] [2024-11-07 10:44:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:42,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:42,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582076142] [2024-11-07 10:44:42,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582076142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:42,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:42,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:44:42,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997636915] [2024-11-07 10:44:42,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:42,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:44:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:44:42,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:44:42,393 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:43,444 INFO L93 Difference]: Finished difference Result 391 states and 567 transitions. [2024-11-07 10:44:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:44:43,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:44:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:43,448 INFO L225 Difference]: With dead ends: 391 [2024-11-07 10:44:43,448 INFO L226 Difference]: Without dead ends: 199 [2024-11-07 10:44:43,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:44:43,449 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:43,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 819 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:44:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-07 10:44:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2024-11-07 10:44:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 175 states have internal predecessors, (245), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:44:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 285 transitions. [2024-11-07 10:44:43,468 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 285 transitions. Word has length 128 [2024-11-07 10:44:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:43,470 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 285 transitions. [2024-11-07 10:44:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 285 transitions. [2024-11-07 10:44:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:44:43,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:43,472 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:43,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:44:43,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:43,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1299704933, now seen corresponding path program 1 times [2024-11-07 10:44:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296890804] [2024-11-07 10:44:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296890804] [2024-11-07 10:44:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296890804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:44,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:44,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207684977] [2024-11-07 10:44:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:44,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:44,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:44,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:44,310 INFO L87 Difference]: Start difference. First operand 197 states and 285 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:44,855 INFO L93 Difference]: Finished difference Result 396 states and 569 transitions. [2024-11-07 10:44:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:44,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:44:44,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:44,857 INFO L225 Difference]: With dead ends: 396 [2024-11-07 10:44:44,857 INFO L226 Difference]: Without dead ends: 202 [2024-11-07 10:44:44,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-11-07 10:44:44,858 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 89 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:44,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 516 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:44:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-07 10:44:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 154. [2024-11-07 10:44:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.4) internal successors, (189), 135 states have internal predecessors, (189), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 221 transitions. [2024-11-07 10:44:44,867 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 221 transitions. Word has length 128 [2024-11-07 10:44:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:44,868 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 221 transitions. [2024-11-07 10:44:44,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 221 transitions. [2024-11-07 10:44:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:44:44,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:44,870 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:44,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:44:44,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1356234675, now seen corresponding path program 1 times [2024-11-07 10:44:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021223682] [2024-11-07 10:44:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:47,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021223682] [2024-11-07 10:44:47,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021223682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:47,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:47,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:44:47,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134522379] [2024-11-07 10:44:47,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:47,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:44:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:47,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:44:47,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:44:47,549 INFO L87 Difference]: Start difference. First operand 154 states and 221 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:44:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:49,029 INFO L93 Difference]: Finished difference Result 360 states and 518 transitions. [2024-11-07 10:44:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:44:49,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-07 10:44:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:49,031 INFO L225 Difference]: With dead ends: 360 [2024-11-07 10:44:49,031 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 10:44:49,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:44:49,033 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 264 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:49,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 546 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:44:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 10:44:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 167. [2024-11-07 10:44:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 148 states have internal predecessors, (210), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2024-11-07 10:44:49,042 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 129 [2024-11-07 10:44:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:49,043 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2024-11-07 10:44:49,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:44:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2024-11-07 10:44:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 10:44:49,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:49,044 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:49,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:44:49,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:49,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash 150390094, now seen corresponding path program 1 times [2024-11-07 10:44:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248689417] [2024-11-07 10:44:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:49,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248689417] [2024-11-07 10:44:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248689417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:49,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:49,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:44:49,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655343863] [2024-11-07 10:44:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:49,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:44:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:49,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:44:49,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:49,369 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:49,695 INFO L93 Difference]: Finished difference Result 401 states and 579 transitions. [2024-11-07 10:44:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:44:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-11-07 10:44:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:49,699 INFO L225 Difference]: With dead ends: 401 [2024-11-07 10:44:49,700 INFO L226 Difference]: Without dead ends: 237 [2024-11-07 10:44:49,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:44:49,701 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 85 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:49,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 613 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:44:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-07 10:44:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 192. [2024-11-07 10:44:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 173 states have (on average 1.4219653179190752) internal successors, (246), 173 states have internal predecessors, (246), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 278 transitions. [2024-11-07 10:44:49,714 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 278 transitions. Word has length 130 [2024-11-07 10:44:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:49,714 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 278 transitions. [2024-11-07 10:44:49,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 278 transitions. [2024-11-07 10:44:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 10:44:49,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:49,716 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:49,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:44:49,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:49,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:49,717 INFO L85 PathProgramCache]: Analyzing trace with hash 524064501, now seen corresponding path program 1 times [2024-11-07 10:44:49,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:49,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093400862] [2024-11-07 10:44:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093400862] [2024-11-07 10:44:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093400862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:51,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:51,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:44:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589341833] [2024-11-07 10:44:51,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:44:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:51,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:44:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:44:51,416 INFO L87 Difference]: Start difference. First operand 192 states and 278 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:44:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:52,362 INFO L93 Difference]: Finished difference Result 421 states and 608 transitions. [2024-11-07 10:44:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:44:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-07 10:44:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:52,365 INFO L225 Difference]: With dead ends: 421 [2024-11-07 10:44:52,365 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 10:44:52,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:44:52,366 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 74 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:52,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 718 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:44:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 10:44:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2024-11-07 10:44:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 171 states have (on average 1.4210526315789473) internal successors, (243), 171 states have internal predecessors, (243), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 275 transitions. [2024-11-07 10:44:52,383 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 275 transitions. Word has length 131 [2024-11-07 10:44:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:52,385 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 275 transitions. [2024-11-07 10:44:52,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:44:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 275 transitions. [2024-11-07 10:44:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:44:52,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:52,388 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:52,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:44:52,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:52,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash 395300704, now seen corresponding path program 1 times [2024-11-07 10:44:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079350872] [2024-11-07 10:44:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:53,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079350872] [2024-11-07 10:44:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079350872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:44:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753969248] [2024-11-07 10:44:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:53,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:44:53,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:44:53,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:53,217 INFO L87 Difference]: Start difference. First operand 190 states and 275 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:53,642 INFO L93 Difference]: Finished difference Result 410 states and 593 transitions. [2024-11-07 10:44:53,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:44:53,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-07 10:44:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:53,644 INFO L225 Difference]: With dead ends: 410 [2024-11-07 10:44:53,644 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 10:44:53,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:44:53,648 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 73 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:53,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 585 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:44:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 10:44:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 190. [2024-11-07 10:44:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 171 states have (on average 1.4152046783625731) internal successors, (242), 171 states have internal predecessors, (242), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 274 transitions. [2024-11-07 10:44:53,661 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 274 transitions. Word has length 133 [2024-11-07 10:44:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:53,663 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 274 transitions. [2024-11-07 10:44:53,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 274 transitions. [2024-11-07 10:44:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:44:53,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:53,665 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:53,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:44:53,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:53,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash -947494858, now seen corresponding path program 1 times [2024-11-07 10:44:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:53,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402313616] [2024-11-07 10:44:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:53,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:54,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:54,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402313616] [2024-11-07 10:44:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402313616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:54,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:54,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:44:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253406799] [2024-11-07 10:44:54,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:54,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:44:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:44:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:54,384 INFO L87 Difference]: Start difference. First operand 190 states and 274 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:54,830 INFO L93 Difference]: Finished difference Result 403 states and 581 transitions. [2024-11-07 10:44:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:44:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-07 10:44:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:54,833 INFO L225 Difference]: With dead ends: 403 [2024-11-07 10:44:54,833 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 10:44:54,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:44:54,834 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 62 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:54,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 487 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:44:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 10:44:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2024-11-07 10:44:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 171 states have (on average 1.409356725146199) internal successors, (241), 171 states have internal predecessors, (241), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 273 transitions. [2024-11-07 10:44:54,845 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 273 transitions. Word has length 134 [2024-11-07 10:44:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:54,845 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 273 transitions. [2024-11-07 10:44:54,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 273 transitions. [2024-11-07 10:44:54,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:44:54,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:54,850 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:54,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:44:54,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:54,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 969372207, now seen corresponding path program 1 times [2024-11-07 10:44:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:54,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763667418] [2024-11-07 10:44:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763667418] [2024-11-07 10:44:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763667418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:55,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:55,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:44:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123789407] [2024-11-07 10:44:55,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:55,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:44:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:44:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:44:55,149 INFO L87 Difference]: Start difference. First operand 190 states and 273 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:55,429 INFO L93 Difference]: Finished difference Result 246 states and 342 transitions. [2024-11-07 10:44:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:44:55,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-07 10:44:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:55,432 INFO L225 Difference]: With dead ends: 246 [2024-11-07 10:44:55,432 INFO L226 Difference]: Without dead ends: 244 [2024-11-07 10:44:55,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:44:55,433 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 46 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:55,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 766 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:44:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-07 10:44:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 222. [2024-11-07 10:44:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 203 states have internal predecessors, (278), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 310 transitions. [2024-11-07 10:44:55,450 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 310 transitions. Word has length 134 [2024-11-07 10:44:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:55,451 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 310 transitions. [2024-11-07 10:44:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 310 transitions. [2024-11-07 10:44:55,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:44:55,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:55,452 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:44:55,452 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1949848935, now seen corresponding path program 1 times [2024-11-07 10:44:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879788290] [2024-11-07 10:44:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:55,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:56,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879788290] [2024-11-07 10:44:56,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879788290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:56,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:56,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:44:56,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022894046] [2024-11-07 10:44:56,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:56,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:44:56,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:56,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:44:56,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:44:56,435 INFO L87 Difference]: Start difference. First operand 222 states and 310 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:57,238 INFO L93 Difference]: Finished difference Result 561 states and 790 transitions. [2024-11-07 10:44:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:44:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-07 10:44:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:57,241 INFO L225 Difference]: With dead ends: 561 [2024-11-07 10:44:57,241 INFO L226 Difference]: Without dead ends: 342 [2024-11-07 10:44:57,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:44:57,242 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 83 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:57,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 820 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:44:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-07 10:44:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 305. [2024-11-07 10:44:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 286 states have (on average 1.402097902097902) internal successors, (401), 286 states have internal predecessors, (401), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 433 transitions. [2024-11-07 10:44:57,258 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 433 transitions. Word has length 135 [2024-11-07 10:44:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:57,258 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 433 transitions. [2024-11-07 10:44:57,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 433 transitions. [2024-11-07 10:44:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:44:57,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:57,260 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:57,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:44:57,260 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1177009616, now seen corresponding path program 1 times [2024-11-07 10:44:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045231378] [2024-11-07 10:44:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045231378] [2024-11-07 10:44:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045231378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:57,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991071354] [2024-11-07 10:44:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:57,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:57,450 INFO L87 Difference]: Start difference. First operand 305 states and 433 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:57,762 INFO L93 Difference]: Finished difference Result 660 states and 929 transitions. [2024-11-07 10:44:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:57,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-07 10:44:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:57,764 INFO L225 Difference]: With dead ends: 660 [2024-11-07 10:44:57,764 INFO L226 Difference]: Without dead ends: 358 [2024-11-07 10:44:57,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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-11-07 10:44:57,765 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 63 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:57,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 384 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:44:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-07 10:44:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 330. [2024-11-07 10:44:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 311 states have (on average 1.3762057877813505) internal successors, (428), 311 states have internal predecessors, (428), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 460 transitions. [2024-11-07 10:44:57,779 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 460 transitions. Word has length 136 [2024-11-07 10:44:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:57,779 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 460 transitions. [2024-11-07 10:44:57,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 460 transitions. [2024-11-07 10:44:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:44:57,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:57,781 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:57,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:44:57,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1223694372, now seen corresponding path program 1 times [2024-11-07 10:44:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:57,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456336230] [2024-11-07 10:44:57,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:57,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:58,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:58,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456336230] [2024-11-07 10:44:58,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456336230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:58,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:58,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:44:58,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751875626] [2024-11-07 10:44:58,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:58,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:44:58,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:58,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:44:58,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:44:58,808 INFO L87 Difference]: Start difference. First operand 330 states and 460 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:59,588 INFO L93 Difference]: Finished difference Result 685 states and 949 transitions. [2024-11-07 10:44:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:44:59,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-07 10:44:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:59,592 INFO L225 Difference]: With dead ends: 685 [2024-11-07 10:44:59,592 INFO L226 Difference]: Without dead ends: 358 [2024-11-07 10:44:59,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:44:59,595 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 37 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:59,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 886 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:44:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-07 10:44:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 332. [2024-11-07 10:44:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 313 states have (on average 1.3738019169329074) internal successors, (430), 313 states have internal predecessors, (430), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:44:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 462 transitions. [2024-11-07 10:44:59,610 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 462 transitions. Word has length 136 [2024-11-07 10:44:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:59,610 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 462 transitions. [2024-11-07 10:44:59,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:44:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 462 transitions. [2024-11-07 10:44:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:44:59,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:59,614 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:59,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:44:59,614 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:59,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1468842291, now seen corresponding path program 1 times [2024-11-07 10:44:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390424198] [2024-11-07 10:44:59,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:44:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:44:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:44:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390424198] [2024-11-07 10:44:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390424198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:59,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:59,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:59,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13349871] [2024-11-07 10:44:59,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:59,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:59,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:59,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:59,845 INFO L87 Difference]: Start difference. First operand 332 states and 462 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:45:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:00,164 INFO L93 Difference]: Finished difference Result 687 states and 955 transitions. [2024-11-07 10:45:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:45:00,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-07 10:45:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:00,166 INFO L225 Difference]: With dead ends: 687 [2024-11-07 10:45:00,166 INFO L226 Difference]: Without dead ends: 358 [2024-11-07 10:45:00,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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-11-07 10:45:00,167 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 62 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:00,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 548 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:45:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-07 10:45:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 332. [2024-11-07 10:45:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 313 states have (on average 1.3674121405750799) internal successors, (428), 313 states have internal predecessors, (428), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:45:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 460 transitions. [2024-11-07 10:45:00,180 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 460 transitions. Word has length 136 [2024-11-07 10:45:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:00,181 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 460 transitions. [2024-11-07 10:45:00,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:45:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 460 transitions. [2024-11-07 10:45:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 10:45:00,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:00,182 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:00,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:45:00,183 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:00,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 465821198, now seen corresponding path program 1 times [2024-11-07 10:45:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:45:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419939816] [2024-11-07 10:45:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:45:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:45:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:45:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:45:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:45:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:45:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:45:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:45:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:45:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:45:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:45:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:45:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:45:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:45:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:45:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:45:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:45:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:45:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:45:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419939816] [2024-11-07 10:45:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419939816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:45:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229370846] [2024-11-07 10:45:00,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:45:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:45:00,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:45:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:45:00,492 INFO L87 Difference]: Start difference. First operand 332 states and 460 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:45:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:00,783 INFO L93 Difference]: Finished difference Result 428 states and 574 transitions. [2024-11-07 10:45:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:45:00,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-07 10:45:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:00,787 INFO L225 Difference]: With dead ends: 428 [2024-11-07 10:45:00,787 INFO L226 Difference]: Without dead ends: 426 [2024-11-07 10:45:00,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:45:00,787 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 59 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:00,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1094 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:45:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-07 10:45:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 389. [2024-11-07 10:45:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 370 states have (on average 1.3324324324324324) internal successors, (493), 370 states have internal predecessors, (493), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:45:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 525 transitions. [2024-11-07 10:45:00,800 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 525 transitions. Word has length 137 [2024-11-07 10:45:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:00,803 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 525 transitions. [2024-11-07 10:45:00,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:45:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 525 transitions. [2024-11-07 10:45:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 10:45:00,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:00,804 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:00,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:45:00,804 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1091653604, now seen corresponding path program 1 times [2024-11-07 10:45:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:45:00,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993439844] [2024-11-07 10:45:00,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:45:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:45:00,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801426977] [2024-11-07 10:45:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:00,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:45:00,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:45:00,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:45:00,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:45:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:45:01,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:45:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:45:01,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:45:01,927 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:45:01,928 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:45:01,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:45:02,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 10:45:02,133 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:02,199 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:45:02,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:45:02 BoogieIcfgContainer [2024-11-07 10:45:02,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:45:02,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:45:02,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:45:02,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:45:02,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:30" (3/4) ... [2024-11-07 10:45:02,209 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:45:02,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:45:02,210 INFO L158 Benchmark]: Toolchain (without parser) took 33445.67ms. Allocated memory was 100.7MB in the beginning and 696.3MB in the end (delta: 595.6MB). Free memory was 77.1MB in the beginning and 647.0MB in the end (delta: -569.9MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-07 10:45:02,211 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:02,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.30ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 60.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:45:02,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.99ms. Allocated memory is still 100.7MB. Free memory was 60.1MB in the beginning and 56.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:02,213 INFO L158 Benchmark]: Boogie Preprocessor took 83.20ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 52.5MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:45:02,213 INFO L158 Benchmark]: RCFGBuilder took 820.85ms. Allocated memory is still 100.7MB. Free memory was 52.3MB in the beginning and 54.6MB in the end (delta: -2.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-07 10:45:02,213 INFO L158 Benchmark]: TraceAbstraction took 32172.90ms. Allocated memory was 100.7MB in the beginning and 696.3MB in the end (delta: 595.6MB). Free memory was 54.1MB in the beginning and 647.1MB in the end (delta: -593.0MB). Peak memory consumption was 396.1MB. Max. memory is 16.1GB. [2024-11-07 10:45:02,213 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 696.3MB. Free memory was 647.1MB in the beginning and 647.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:02,214 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.30ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.30ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 60.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.99ms. Allocated memory is still 100.7MB. Free memory was 60.1MB in the beginning and 56.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 83.20ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 52.5MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 820.85ms. Allocated memory is still 100.7MB. Free memory was 52.3MB in the beginning and 54.6MB in the end (delta: -2.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 32172.90ms. Allocated memory was 100.7MB in the beginning and 696.3MB in the end (delta: 595.6MB). Free memory was 54.1MB in the beginning and 647.1MB in the end (delta: -593.0MB). Peak memory consumption was 396.1MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 696.3MB. Free memory was 647.1MB in the beginning and 647.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of shiftLeft at line 106. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -5, 0, 1000, 10, 32, 5, 1.1, 7.8, 1.75, 32, 64, 1230482582 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L77] WrapperStruct00.var_1_2 = __VERIFIER_nondet_short() [L78] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L79] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L81] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L81] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L82] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L84] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L87] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_7 [L90] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_7 [L90] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_8 [L92] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_8 [L92] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_9 [L94] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_9 [L94] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_11 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_11 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_12 = __VERIFIER_nondet_long() [L100] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] RET updateVariables() [L115] CALL step() [L54] EXPR WrapperStruct00.var_1_2 [L54] EXPR WrapperStruct00.var_1_3 [L54] EXPR WrapperStruct00.var_1_4 [L54] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L54] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) [L54] EXPR WrapperStruct00.var_1_4 [L54] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1] [L54] WrapperStruct00.var_1_1 = ((((((16) > (4)) ? (16) : (4))) + WrapperStruct00.var_1_2) - (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))))) [L55] EXPR WrapperStruct00.var_1_2 [L55] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] COND FALSE !(WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_1) [L62] EXPR WrapperStruct00.var_1_4 [L62] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_4 [L64] EXPR WrapperStruct00.var_1_6 [L64] EXPR WrapperStruct00.var_1_4 [L64] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] EXPR WrapperStruct00.var_1_4 << WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] signed long int stepLocal_1 = WrapperStruct00.var_1_6 + (WrapperStruct00.var_1_4 << WrapperStruct00.var_1_2); [L65] EXPR WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_12 [L65] EXPR WrapperStruct00.var_1_5 [L65] signed long int stepLocal_0 = WrapperStruct00.var_1_2 - (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_5); [L66] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-1230482540, stepLocal_1=13] [L66] COND TRUE stepLocal_1 != WrapperStruct00.var_1_5 [L67] EXPR WrapperStruct00.var_1_3 [L67] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-1230482540] [L67] COND FALSE !((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_11) < stepLocal_0) [L70] EXPR WrapperStruct00.var_1_4 [L70] WrapperStruct00.var_1_10 = WrapperStruct00.var_1_4 [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + WrapperStruct00.var_1_2) - (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))))))) && ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_1) ? ((((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_3)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_1))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4))) [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_1) ? ((((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_3)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_1))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) [L106] EXPR WrapperStruct00.var_1_6 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR (WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_1) ? ((((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_3)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_1))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + WrapperStruct00.var_1_2) - (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))))))) && ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_1) ? ((((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_3)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_1))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + WrapperStruct00.var_1_2) - (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))))))) && ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_1) ? ((((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_3)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_1))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)))) && (((WrapperStruct00.var_1_6 + (WrapperStruct00.var_1_4 << WrapperStruct00.var_1_2)) != WrapperStruct00.var_1_5) ? (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_2 - (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_10 == ((signed long int) ((((-256) < (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2)))))))) ? (-256) : (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))))))))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_4))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_2))) [L106] EXPR WrapperStruct00.var_1_6 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_4 << WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_6 + (WrapperStruct00.var_1_4 << WrapperStruct00.var_1_2)) != WrapperStruct00.var_1_5) ? (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_2 - (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_10 == ((signed long int) ((((-256) < (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2)))))))) ? (-256) : (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))))))))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_4))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_2)) [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR ((WrapperStruct00.var_1_6 + (WrapperStruct00.var_1_4 << WrapperStruct00.var_1_2)) != WrapperStruct00.var_1_5) ? (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_2 - (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_10 == ((signed long int) ((((-256) < (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2)))))))) ? (-256) : (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))))))))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_4))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_2)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + WrapperStruct00.var_1_2) - (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))))))) && ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_1) ? ((((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_3)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_1))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)))) && (((WrapperStruct00.var_1_6 + (WrapperStruct00.var_1_4 << WrapperStruct00.var_1_2)) != WrapperStruct00.var_1_5) ? (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_2 - (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_10 == ((signed long int) ((((-256) < (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2)))))))) ? (-256) : (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))))))))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_4))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_2))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106-L107] return ((WrapperStruct00.var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + WrapperStruct00.var_1_2) - (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5))))))) && ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_1) ? ((((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_3)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_1))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)))) && (((WrapperStruct00.var_1_6 + (WrapperStruct00.var_1_4 << WrapperStruct00.var_1_2)) != WrapperStruct00.var_1_5) ? (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_2 - (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_10 == ((signed long int) ((((-256) < (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2)))))))) ? (-256) : (((((WrapperStruct00.var_1_4) < (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_2)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_2))))))))))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_4))) : (WrapperStruct00.var_1_10 == ((signed long int) WrapperStruct00.var_1_2))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.0s, OverallIterations: 18, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1475 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1470 mSDsluCounter, 11414 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8863 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8856 IncrementalHoareTripleChecker+Invalid, 8920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 2551 mSDtfsCounter, 8856 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 830 GetRequests, 700 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=17, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 506 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 2513 NumberOfCodeBlocks, 2513 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2222 ConstructedInterpolants, 0 QuantifiedInterpolants, 9330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 8160/8160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:45:02,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c93cc267f3fa9111282ae2218d996ece9eec8d2b16bef9815b7e16fff94a7e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:45:04,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:45:04,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:45:04,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:45:04,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:45:04,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:45:04,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:45:04,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:45:04,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:45:04,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:45:04,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:45:04,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:45:04,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:45:04,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:45:04,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:45:04,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:45:04,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:45:04,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:45:04,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:45:04,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:45:04,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:45:04,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:45:04,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:45:04,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:45:04,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:45:04,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:45:04,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:45:04,573 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:45:04,573 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:45:04,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:45:04,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:45:04,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:45:04,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:45:04,575 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c93cc267f3fa9111282ae2218d996ece9eec8d2b16bef9815b7e16fff94a7e6 [2024-11-07 10:45:04,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:45:04,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:45:04,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:45:04,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:45:04,851 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:45:04,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i [2024-11-07 10:45:06,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:45:06,454 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:45:06,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i [2024-11-07 10:45:06,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aec4b1674/3f298582a2b24e23a4dc1a04b88b64b5/FLAG9799be548 [2024-11-07 10:45:06,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aec4b1674/3f298582a2b24e23a4dc1a04b88b64b5 [2024-11-07 10:45:06,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:45:06,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:45:06,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:45:06,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:45:06,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:45:06,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a750e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06, skipping insertion in model container [2024-11-07 10:45:06,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:45:06,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i[916,929] [2024-11-07 10:45:06,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:45:06,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:45:06,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-39.i[916,929] [2024-11-07 10:45:06,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:45:06,831 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:45:06,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06 WrapperNode [2024-11-07 10:45:06,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:45:06,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:45:06,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:45:06,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:45:06,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,905 INFO L138 Inliner]: procedures = 37, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 581 [2024-11-07 10:45:06,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:45:06,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:45:06,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:45:06,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:45:06,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,955 INFO L175 MemorySlicer]: Split 161 memory accesses to 2 slices as follows [2, 159]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-07 10:45:06,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:06,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:07,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:07,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:07,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:07,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:45:07,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:45:07,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:45:07,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:45:07,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (1/1) ... [2024-11-07 10:45:07,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:45:07,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:45:07,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:45:07,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:45:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:45:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:45:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:45:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:45:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:45:07,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:45:07,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:45:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:45:07,237 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:45:07,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:45:08,416 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-07 10:45:08,416 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:45:08,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:45:08,426 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:45:08,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:45:08 BoogieIcfgContainer [2024-11-07 10:45:08,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:45:08,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:45:08,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:45:08,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:45:08,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:45:06" (1/3) ... [2024-11-07 10:45:08,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196643e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:45:08, skipping insertion in model container [2024-11-07 10:45:08,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:06" (2/3) ... [2024-11-07 10:45:08,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196643e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:45:08, skipping insertion in model container [2024-11-07 10:45:08,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:45:08" (3/3) ... [2024-11-07 10:45:08,434 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-39.i [2024-11-07 10:45:08,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:45:08,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:45:08,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:45:08,526 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;@7f4cbdcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:45:08,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:45:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:45:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:45:08,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:08,544 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:08,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:08,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1102926622, now seen corresponding path program 1 times [2024-11-07 10:45:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:08,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828362268] [2024-11-07 10:45:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:45:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:08,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:45:08,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 10:45:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:08,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:45:08,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-07 10:45:08,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:45:08,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:45:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828362268] [2024-11-07 10:45:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828362268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:08,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:45:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787524548] [2024-11-07 10:45:08,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:08,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:45:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:45:08,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:45:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:45:08,974 INFO L87 Difference]: Start difference. First operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:45:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:09,003 INFO L93 Difference]: Finished difference Result 221 states and 348 transitions. [2024-11-07 10:45:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:45:09,005 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-11-07 10:45:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:09,013 INFO L225 Difference]: With dead ends: 221 [2024-11-07 10:45:09,013 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 10:45:09,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:45:09,019 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:09,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:45:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 10:45:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-07 10:45:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:45:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2024-11-07 10:45:09,067 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 126 [2024-11-07 10:45:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:09,068 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2024-11-07 10:45:09,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:45:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2024-11-07 10:45:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:45:09,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:09,072 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:09,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:45:09,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:45:09,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:09,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash -405452762, now seen corresponding path program 1 times [2024-11-07 10:45:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624990792] [2024-11-07 10:45:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:09,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:45:09,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:09,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:45:09,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 10:45:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:09,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-07 10:45:09,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:09,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:45:10,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-07 10:45:10,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2024-11-07 10:45:11,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 72 [2024-11-07 10:45:13,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:13,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 75 [2024-11-07 10:45:14,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:14,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 75 [2024-11-07 10:45:14,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:14,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 75 [2024-11-07 10:45:15,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:15,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 85 [2024-11-07 10:45:16,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:16,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 78 [2024-11-07 10:45:17,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 106 [2024-11-07 10:45:17,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 162 treesize of output 130 [2024-11-07 10:45:18,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:18,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 237 treesize of output 161 [2024-11-07 10:45:19,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:19,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 214 treesize of output 102 [2024-11-07 10:45:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 236 proven. 192 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-07 10:45:19,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:45:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:45:20,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:45:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624990792] [2024-11-07 10:45:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624990792] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:45:20,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:45:20,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [44] total 51 [2024-11-07 10:45:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92355638] [2024-11-07 10:45:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:20,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:45:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:45:20,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:45:20,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=2133, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 10:45:20,828 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:45:25,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:45:28,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:45:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:31,907 INFO L93 Difference]: Finished difference Result 315 states and 462 transitions. [2024-11-07 10:45:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:45:31,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-07 10:45:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:31,910 INFO L225 Difference]: With dead ends: 315 [2024-11-07 10:45:31,910 INFO L226 Difference]: Without dead ends: 208 [2024-11-07 10:45:31,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=467, Invalid=2503, Unknown=0, NotChecked=0, Total=2970 [2024-11-07 10:45:31,914 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 247 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:31,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 666 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-07 10:45:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-07 10:45:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 158. [2024-11-07 10:45:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.4074074074074074) internal successors, (190), 136 states have internal predecessors, (190), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:45:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-11-07 10:45:31,931 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 126 [2024-11-07 10:45:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:31,931 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-07 10:45:31,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:45:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2024-11-07 10:45:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:45:31,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:31,934 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:31,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:45:32,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:45:32,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:32,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1085511132, now seen corresponding path program 1 times [2024-11-07 10:45:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120645600] [2024-11-07 10:45:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:32,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:45:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:32,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:45:32,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 10:45:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:32,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-07 10:45:32,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:32,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:45:32,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-07 10:45:33,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2024-11-07 10:45:34,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 76 [2024-11-07 10:45:35,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:35,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 79 [2024-11-07 10:45:36,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:36,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 79 [2024-11-07 10:45:36,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:36,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 79 [2024-11-07 10:45:37,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:37,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 89