./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.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_operatoramount_amount10_file-76.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', 'b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79'] 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_operatoramount_amount10_file-76.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 b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:15:32,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:15:32,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:15:32,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:15:32,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:15:32,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:15:32,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:15:32,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:15:32,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:15:32,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:15:32,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:15:32,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:15:32,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:15:32,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:15:32,967 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:15:32,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:15:32,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:15:32,967 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:15:32,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:15:32,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:15:32,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:15:32,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:15:32,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:15:32,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:15:32,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:15:32,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:15:32,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:15:32,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:15:32,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:15:32,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:15:32,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:15:32,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:15:32,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:15:32,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:15:32,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:15:32,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:15:32,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:15:32,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:15:32,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:15:32,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:15:32,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:15:32,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:15:32,973 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 -> b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 [2024-11-07 09:15:33,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:15:33,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:15:33,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:15:33,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:15:33,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:15:33,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-11-07 09:15:34,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:15:34,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:15:34,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-11-07 09:15:34,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99cf9ecf7/151a730b5b5c4a809a579b4b7eed1eb6/FLAG7ec264289 [2024-11-07 09:15:34,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99cf9ecf7/151a730b5b5c4a809a579b4b7eed1eb6 [2024-11-07 09:15:34,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:15:34,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:15:34,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:15:34,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:15:34,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:15:34,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:15:34" (1/1) ... [2024-11-07 09:15:34,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259767ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:34, skipping insertion in model container [2024-11-07 09:15:34,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:15:34" (1/1) ... [2024-11-07 09:15:34,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:15:35,085 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_operatoramount_amount10_file-76.i[915,928] [2024-11-07 09:15:35,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:15:35,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:15:35,153 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_operatoramount_amount10_file-76.i[915,928] [2024-11-07 09:15:35,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:15:35,188 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:15:35,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35 WrapperNode [2024-11-07 09:15:35,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:15:35,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:15:35,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:15:35,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:15:35,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,227 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2024-11-07 09:15:35,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:15:35,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:15:35,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:15:35,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:15:35,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,254 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:15:35,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:15:35,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:15:35,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:15:35,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:15:35,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (1/1) ... [2024-11-07 09:15:35,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:15:35,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:15:35,310 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 09:15:35,314 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 09:15:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:15:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:15:35,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:15:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:15:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:15:35,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:15:35,402 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:15:35,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:15:35,542 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 09:15:35,542 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:15:35,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:15:35,549 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:15:35,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:35 BoogieIcfgContainer [2024-11-07 09:15:35,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:15:35,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:15:35,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:15:35,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:15:35,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:15:34" (1/3) ... [2024-11-07 09:15:35,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592f46da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:15:35, skipping insertion in model container [2024-11-07 09:15:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:35" (2/3) ... [2024-11-07 09:15:35,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592f46da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:15:35, skipping insertion in model container [2024-11-07 09:15:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:35" (3/3) ... [2024-11-07 09:15:35,560 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-76.i [2024-11-07 09:15:35,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:15:35,574 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:15:35,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:15:35,648 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;@7db29753, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:15:35,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:15:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 09:15:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 09:15:35,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:35,660 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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 09:15:35,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:35,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash -621472132, now seen corresponding path program 1 times [2024-11-07 09:15:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:15:35,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227010711] [2024-11-07 09:15:35,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:35,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:15:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:35,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:15:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:15:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:15:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 09:15:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:15:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:15:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:15:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 09:15:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:15:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227010711] [2024-11-07 09:15:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227010711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:35,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:15:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211274409] [2024-11-07 09:15:35,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:35,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:15:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:15:35,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:15:35,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:15:35,917 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 09:15:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:35,936 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2024-11-07 09:15:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:15:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-11-07 09:15:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:35,944 INFO L225 Difference]: With dead ends: 61 [2024-11-07 09:15:35,944 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 09:15:35,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 09:15:35,951 INFO L432 NwaCegarLoop]: 38 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, 38 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 09:15:35,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:15:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 09:15:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 09:15:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 09:15:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-07 09:15:35,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 52 [2024-11-07 09:15:35,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:35,995 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-07 09:15:35,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 09:15:35,996 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-07 09:15:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 09:15:35,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:35,999 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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 09:15:35,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:15:36,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:36,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash 176339458, now seen corresponding path program 1 times [2024-11-07 09:15:36,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:15:36,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393506769] [2024-11-07 09:15:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:15:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:36,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:15:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:15:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:15:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:36,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 09:15:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:15:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:36,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:15:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:36,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:15:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 09:15:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:15:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393506769] [2024-11-07 09:15:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393506769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:36,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 09:15:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548240968] [2024-11-07 09:15:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:36,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:15:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:15:36,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:15:36,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:15:36,370 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 09:15:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:36,444 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-11-07 09:15:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:15:36,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2024-11-07 09:15:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:36,447 INFO L225 Difference]: With dead ends: 57 [2024-11-07 09:15:36,448 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 09:15:36,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:15:36,449 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:15:36,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:15:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 09:15:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 09:15:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 09:15:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-07 09:15:36,458 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-07 09:15:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:36,459 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-07 09:15:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 09:15:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-07 09:15:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 09:15:36,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:36,460 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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 09:15:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:15:36,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 233597760, now seen corresponding path program 1 times [2024-11-07 09:15:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:15:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045351738] [2024-11-07 09:15:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:15:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:15:36,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:15:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:15:36,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:15:36,555 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:15:36,556 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:15:36,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:15:36,561 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 09:15:36,606 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:15:36,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:15:36 BoogieIcfgContainer [2024-11-07 09:15:36,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:15:36,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:15:36,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:15:36,610 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:15:36,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:35" (3/4) ... [2024-11-07 09:15:36,613 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:15:36,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:15:36,615 INFO L158 Benchmark]: Toolchain (without parser) took 1690.44ms. Allocated memory is still 109.1MB. Free memory was 85.8MB in the beginning and 40.3MB in the end (delta: 45.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-07 09:15:36,616 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:15:36,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.85ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 74.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:15:36,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.75ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 72.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:15:36,618 INFO L158 Benchmark]: Boogie Preprocessor took 41.58ms. Allocated memory is still 109.1MB. Free memory was 72.7MB in the beginning and 71.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:15:36,619 INFO L158 Benchmark]: RCFGBuilder took 276.30ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 59.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:15:36,619 INFO L158 Benchmark]: TraceAbstraction took 1057.60ms. Allocated memory is still 109.1MB. Free memory was 59.4MB in the beginning and 40.9MB in the end (delta: 18.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-07 09:15:36,619 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 109.1MB. Free memory was 40.9MB in the beginning and 40.3MB in the end (delta: 582.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:15:36,622 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.32ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.85ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 74.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.75ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 72.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.58ms. Allocated memory is still 109.1MB. Free memory was 72.7MB in the beginning and 71.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 276.30ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 59.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1057.60ms. Allocated memory is still 109.1MB. Free memory was 59.4MB in the beginning and 40.9MB in the end (delta: 18.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 109.1MB. Free memory was 40.9MB in the beginning and 40.3MB in the end (delta: 582.8kB). 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 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 32.81; [L23] float var_1_3 = 256.25; [L24] float var_1_4 = 1.75; [L25] double var_1_5 = 10000000.5; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 0; [L29] signed char var_1_10 = 5; [L30] double last_1_var_1_1 = 32.81; [L31] unsigned char last_1_var_1_6 = 0; VAL [isInitial=0, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_3=1025/4, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] CALL updateLastVariables() [L58] last_1_var_1_1 = var_1_1 [L59] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_3=1025/4, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L69] RET updateLastVariables() [L70] CALL updateVariables() [L44] var_1_3 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L45] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L46] var_1_4 = __VERIFIER_nondet_float() [L47] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L47] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L48] var_1_5 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L49] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L50] var_1_8 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L51] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L52] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L52] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L53] var_1_9 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L54] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L55] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L55] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L70] RET updateVariables() [L71] CALL step() [L35] COND FALSE !(last_1_var_1_1 < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) - 199.2f)) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L38] COND FALSE !(\read(last_1_var_1_6)) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L41] var_1_10 = -50 VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return (((last_1_var_1_1 < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) - 199.2f)) ? (var_1_1 == ((double) var_1_5)) : 1) && (last_1_var_1_6 ? (var_1_6 == ((unsigned char) (! (var_1_8 || var_1_9)))) : 1)) && (var_1_10 == ((signed char) -50)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 72 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 168/168 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 09:15:36,651 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_operatoramount_amount10_file-76.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 b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:15:38,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:15:38,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:15:38,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:15:38,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:15:39,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:15:39,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:15:39,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:15:39,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:15:39,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:15:39,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:15:39,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:15:39,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:15:39,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:15:39,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:15:39,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:15:39,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:15:39,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:15:39,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:15:39,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:15:39,041 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:15:39,041 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:15:39,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:15:39,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:15:39,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:15:39,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:15:39,043 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 -> b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 [2024-11-07 09:15:39,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:15:39,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:15:39,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:15:39,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:15:39,358 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:15:39,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-11-07 09:15:40,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:15:41,017 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:15:41,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-11-07 09:15:41,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96e177af5/e561024af9e44833a1174a2bbf797a2a/FLAG6331c5332 [2024-11-07 09:15:41,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96e177af5/e561024af9e44833a1174a2bbf797a2a [2024-11-07 09:15:41,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:15:41,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:15:41,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:15:41,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:15:41,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:15:41,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bc128a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41, skipping insertion in model container [2024-11-07 09:15:41,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:15:41,186 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_operatoramount_amount10_file-76.i[915,928] [2024-11-07 09:15:41,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:15:41,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:15:41,245 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_operatoramount_amount10_file-76.i[915,928] [2024-11-07 09:15:41,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:15:41,270 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:15:41,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41 WrapperNode [2024-11-07 09:15:41,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:15:41,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:15:41,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:15:41,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:15:41,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,306 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2024-11-07 09:15:41,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:15:41,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:15:41,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:15:41,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:15:41,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,329 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 09:15:41,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:15:41,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:15:41,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:15:41,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:15:41,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (1/1) ... [2024-11-07 09:15:41,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:15:41,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:15:41,387 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 09:15:41,391 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 09:15:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:15:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:15:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:15:41,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:15:41,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:15:41,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:15:41,501 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:15:41,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:15:42,647 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 09:15:42,647 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:15:42,660 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:15:42,661 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:15:42,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:42 BoogieIcfgContainer [2024-11-07 09:15:42,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:15:42,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:15:42,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:15:42,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:15:42,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:15:41" (1/3) ... [2024-11-07 09:15:42,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9af192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:15:42, skipping insertion in model container [2024-11-07 09:15:42,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:15:41" (2/3) ... [2024-11-07 09:15:42,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9af192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:15:42, skipping insertion in model container [2024-11-07 09:15:42,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:15:42" (3/3) ... [2024-11-07 09:15:42,674 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-76.i [2024-11-07 09:15:42,689 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:15:42,691 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:15:42,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:15:42,761 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;@52786b31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:15:42,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:15:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 09:15:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 09:15:42,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:42,775 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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 09:15:42,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:42,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash -621472132, now seen corresponding path program 1 times [2024-11-07 09:15:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:15:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491540405] [2024-11-07 09:15:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:42,789 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 09:15:42,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:15:42,793 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 09:15:42,794 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 09:15:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:42,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:15:42,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:15:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 09:15:43,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:15:43,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:15:43,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491540405] [2024-11-07 09:15:43,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491540405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:43,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:43,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:15:43,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711909237] [2024-11-07 09:15:43,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:15:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:15:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:15:43,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:15:43,040 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 09:15:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:43,059 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2024-11-07 09:15:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:15:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-11-07 09:15:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:43,066 INFO L225 Difference]: With dead ends: 61 [2024-11-07 09:15:43,066 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 09:15:43,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 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 09:15:43,072 INFO L432 NwaCegarLoop]: 38 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, 38 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 09:15:43,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:15:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 09:15:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 09:15:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 09:15:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-07 09:15:43,111 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 52 [2024-11-07 09:15:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:43,112 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-07 09:15:43,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 09:15:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-07 09:15:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 09:15:43,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:43,117 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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 09:15:43,124 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 09:15:43,317 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 09:15:43,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:43,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash 176339458, now seen corresponding path program 1 times [2024-11-07 09:15:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:15:43,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326360231] [2024-11-07 09:15:43,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:43,328 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 09:15:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:15:43,331 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 09:15:43,332 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 09:15:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:43,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 09:15:43,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:15:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 09:15:43,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:15:43,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:15:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326360231] [2024-11-07 09:15:43,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326360231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:15:43,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:15:43,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:15:43,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678623073] [2024-11-07 09:15:43,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:15:43,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:15:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:15:43,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:15:43,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:15:43,687 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 09:15:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:15:44,102 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-11-07 09:15:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:15:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2024-11-07 09:15:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:15:44,112 INFO L225 Difference]: With dead ends: 57 [2024-11-07 09:15:44,112 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 09:15:44,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:15:44,113 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:15:44,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:15:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 09:15:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 09:15:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 09:15:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-07 09:15:44,120 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-07 09:15:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:15:44,122 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-07 09:15:44,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 09:15:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-07 09:15:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 09:15:44,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:15:44,123 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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 09:15:44,128 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 09:15:44,324 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 09:15:44,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:15:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:15:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash 233597760, now seen corresponding path program 1 times [2024-11-07 09:15:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:15:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463213982] [2024-11-07 09:15:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:15:44,325 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 09:15:44,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:15:44,330 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 09:15:44,331 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 09:15:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:15:44,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 09:15:44,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:16:01,170 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 09:16:25,026 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 09:16:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 09:16:45,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:16:45,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:16:45,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463213982] [2024-11-07 09:16:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463213982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:16:45,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:16:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:16:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692570503] [2024-11-07 09:16:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:45,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:16:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:16:45,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:16:45,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:16:45,185 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 09:16:47,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:16:51,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:17:00,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:17:04,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:17:09,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:17:11,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:17:12,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []