./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.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', '6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.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 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:53:33,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:53:34,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:53:34,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:53:34,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:53:34,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:53:34,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:53:34,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:53:34,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:53:34,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:53:34,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:53:34,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:53:34,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:53:34,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:53:34,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:34,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:53:34,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:53:34,028 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 -> 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 [2024-11-07 10:53:34,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:53:34,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:53:34,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:53:34,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:53:34,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:53:34,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-07 10:53:35,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:53:35,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:53:35,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-07 10:53:35,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/522a23f3e/fd93cb66eb134d9184ce1a13df40cd16/FLAGa8bb5e236 [2024-11-07 10:53:36,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/522a23f3e/fd93cb66eb134d9184ce1a13df40cd16 [2024-11-07 10:53:36,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:53:36,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:53:36,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:36,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:53:36,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:53:36,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c6c7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36, skipping insertion in model container [2024-11-07 10:53:36,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:53:36,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2024-11-07 10:53:36,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:36,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:53:36,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2024-11-07 10:53:36,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:36,643 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:53:36,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36 WrapperNode [2024-11-07 10:53:36,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:36,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:36,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:53:36,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:53:36,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,707 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2024-11-07 10:53:36,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:36,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:53:36,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:53:36,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:53:36,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,734 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:53:36,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:53:36,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:53:36,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:53:36,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:53:36,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (1/1) ... [2024-11-07 10:53:36,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:36,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:53:36,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:53:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:53:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:53:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:53:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:53:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:53:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:53:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:53:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:53:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:53:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:53:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:53:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:53:36,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:53:36,954 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:53:37,957 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-07 10:53:37,957 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:53:37,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:53:37,969 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:53:37,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:37 BoogieIcfgContainer [2024-11-07 10:53:37,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:53:37,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:53:37,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:53:37,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:53:37,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:53:36" (1/3) ... [2024-11-07 10:53:37,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc5b39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:37, skipping insertion in model container [2024-11-07 10:53:37,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:36" (2/3) ... [2024-11-07 10:53:37,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc5b39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:37, skipping insertion in model container [2024-11-07 10:53:37,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:37" (3/3) ... [2024-11-07 10:53:37,988 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-07 10:53:38,009 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:53:38,009 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:53:38,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:53:38,052 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;@5a9ef16f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:53:38,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:53:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:53:38,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:38,065 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:38,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:38,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1279411170, now seen corresponding path program 1 times [2024-11-07 10:53:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684773856] [2024-11-07 10:53:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:53:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:53:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:53:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:53:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:53:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:53:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:53:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:53:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:53:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:53:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:53:38,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684773856] [2024-11-07 10:53:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684773856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:38,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:38,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:53:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945425340] [2024-11-07 10:53:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:38,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:53:38,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:38,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:53:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:38,516 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:53:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:38,539 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2024-11-07 10:53:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:53:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:53:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:38,552 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:53:38,552 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:53:38,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:38,561 INFO L432 NwaCegarLoop]: 176 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, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:38,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:53:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:53:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-07 10:53:38,616 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2024-11-07 10:53:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:38,617 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-07 10:53:38,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:53:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-07 10:53:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:53:38,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:38,620 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:38,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:53:38,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1334114070, now seen corresponding path program 1 times [2024-11-07 10:53:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247034848] [2024-11-07 10:53:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:38,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:53:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:53:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:53:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:53:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:53:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:53:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:53:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:53:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:53:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:53:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:53:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247034848] [2024-11-07 10:53:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247034848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:39,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:39,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:53:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424786823] [2024-11-07 10:53:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:39,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:39,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:39,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:39,052 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:53:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:39,108 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-11-07 10:53:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:39,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:53:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:39,110 INFO L225 Difference]: With dead ends: 239 [2024-11-07 10:53:39,110 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:53:39,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:39,112 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:39,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:53:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:53:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-07 10:53:39,121 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2024-11-07 10:53:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:39,123 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-07 10:53:39,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:53:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-07 10:53:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:53:39,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:39,125 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:39,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:53:39,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:39,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash 699279976, now seen corresponding path program 1 times [2024-11-07 10:53:39,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:39,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63151293] [2024-11-07 10:53:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:39,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:53:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:53:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:53:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:53:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:53:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:53:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:53:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:53:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:53:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:53:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:53:44,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:44,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63151293] [2024-11-07 10:53:44,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63151293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 10:53:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002117303] [2024-11-07 10:53:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:44,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 10:53:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 10:53:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:53:44,772 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-07 10:53:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:46,803 INFO L93 Difference]: Finished difference Result 332 states and 484 transitions. [2024-11-07 10:53:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:53:46,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 165 [2024-11-07 10:53:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:46,805 INFO L225 Difference]: With dead ends: 332 [2024-11-07 10:53:46,805 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 10:53:46,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2024-11-07 10:53:46,806 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1104 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:46,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 741 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 10:53:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 10:53:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 137. [2024-11-07 10:53:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.4) internal successors, (161), 115 states have internal predecessors, (161), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2024-11-07 10:53:46,821 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 165 [2024-11-07 10:53:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:46,821 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 201 transitions. [2024-11-07 10:53:46,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-07 10:53:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2024-11-07 10:53:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:53:46,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:46,823 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:46,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:53:46,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:46,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 112473962, now seen corresponding path program 1 times [2024-11-07 10:53:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:46,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952539908] [2024-11-07 10:53:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:53:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:53:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:53:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:53:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:53:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:53:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:53:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:53:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:53:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:53:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:53:51,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952539908] [2024-11-07 10:53:51,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952539908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:51,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:51,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:53:51,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091233500] [2024-11-07 10:53:51,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:51,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:53:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:51,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:53:51,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:53:51,094 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-07 10:53:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:53,223 INFO L93 Difference]: Finished difference Result 342 states and 500 transitions. [2024-11-07 10:53:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:53:53,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 165 [2024-11-07 10:53:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:53,231 INFO L225 Difference]: With dead ends: 342 [2024-11-07 10:53:53,232 INFO L226 Difference]: Without dead ends: 208 [2024-11-07 10:53:53,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:53:53,235 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 537 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:53,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 809 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 10:53:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-07 10:53:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 146. [2024-11-07 10:53:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 214 transitions. [2024-11-07 10:53:53,260 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 214 transitions. Word has length 165 [2024-11-07 10:53:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:53,261 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 214 transitions. [2024-11-07 10:53:53,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-07 10:53:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 214 transitions. [2024-11-07 10:53:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:53:53,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:53,265 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:53,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:53:53,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:53,266 INFO L85 PathProgramCache]: Analyzing trace with hash -118368474, now seen corresponding path program 1 times [2024-11-07 10:53:53,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:53,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019175713] [2024-11-07 10:53:53,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:53,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:53:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:53:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:53:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:53:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:53:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:53:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:53:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:53:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:53:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:53:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:53:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019175713] [2024-11-07 10:53:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019175713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:55,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:55,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:53:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077695398] [2024-11-07 10:53:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:55,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:53:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:53:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:53:55,942 INFO L87 Difference]: Start difference. First operand 146 states and 214 transitions. Second operand has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:53:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:57,424 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2024-11-07 10:53:57,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:53:57,425 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-07 10:53:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:57,427 INFO L225 Difference]: With dead ends: 322 [2024-11-07 10:53:57,427 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 10:53:57,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:53:57,428 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 261 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:57,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 872 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:53:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 10:53:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 137. [2024-11-07 10:53:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-07 10:53:57,442 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 165 [2024-11-07 10:53:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:57,442 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-07 10:53:57,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:53:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-07 10:53:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:53:57,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:57,444 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:57,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:53:57,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:57,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash 565266470, now seen corresponding path program 1 times [2024-11-07 10:53:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:57,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114734653] [2024-11-07 10:53:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:53:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:53:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:53:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:53:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:53:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:53:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:53:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:53:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:53:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:53:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:53:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:59,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114734653] [2024-11-07 10:53:59,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114734653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:59,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:59,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:53:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818011298] [2024-11-07 10:53:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:59,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:53:59,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:53:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:53:59,700 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:00,605 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2024-11-07 10:54:00,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:54:00,606 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-07 10:54:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:00,607 INFO L225 Difference]: With dead ends: 315 [2024-11-07 10:54:00,607 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 10:54:00,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:54:00,608 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 321 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:00,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 460 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:54:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 10:54:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-11-07 10:54:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2024-11-07 10:54:00,618 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2024-11-07 10:54:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:00,618 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2024-11-07 10:54:00,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2024-11-07 10:54:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:54:00,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:00,619 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:00,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:54:00,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:00,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash -21539544, now seen corresponding path program 1 times [2024-11-07 10:54:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:00,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465597024] [2024-11-07 10:54:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:02,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465597024] [2024-11-07 10:54:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465597024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:02,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:02,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:54:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443959781] [2024-11-07 10:54:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:02,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:54:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:54:02,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:54:02,290 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:03,710 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2024-11-07 10:54:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:54:03,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-07 10:54:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:03,713 INFO L225 Difference]: With dead ends: 326 [2024-11-07 10:54:03,713 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 10:54:03,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:54:03,714 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 177 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:03,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 935 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:54:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 10:54:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-11-07 10:54:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2024-11-07 10:54:03,730 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2024-11-07 10:54:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:03,731 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2024-11-07 10:54:03,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2024-11-07 10:54:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:03,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:03,732 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:03,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:54:03,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:03,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash -575774022, now seen corresponding path program 1 times [2024-11-07 10:54:03,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:03,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415612188] [2024-11-07 10:54:03,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415612188] [2024-11-07 10:54:03,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415612188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:54:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638329615] [2024-11-07 10:54:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:03,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:54:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:54:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:54:03,908 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:54:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:03,937 INFO L93 Difference]: Finished difference Result 296 states and 435 transitions. [2024-11-07 10:54:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:54:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2024-11-07 10:54:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:03,939 INFO L225 Difference]: With dead ends: 296 [2024-11-07 10:54:03,939 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 10:54:03,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:54:03,940 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:03,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:54:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 10:54:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-07 10:54:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2024-11-07 10:54:03,955 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 167 [2024-11-07 10:54:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:03,956 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2024-11-07 10:54:03,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:54:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2024-11-07 10:54:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:03,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:03,957 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:03,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:54:03,957 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:03,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1938987293, now seen corresponding path program 1 times [2024-11-07 10:54:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601485955] [2024-11-07 10:54:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:03,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601485955] [2024-11-07 10:54:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601485955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:06,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:06,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:54:06,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462885504] [2024-11-07 10:54:06,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:06,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:54:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:54:06,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:54:06,458 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:07,671 INFO L93 Difference]: Finished difference Result 341 states and 494 transitions. [2024-11-07 10:54:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:54:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-07 10:54:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:07,673 INFO L225 Difference]: With dead ends: 341 [2024-11-07 10:54:07,676 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 10:54:07,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:54:07,677 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 457 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:07,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 646 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:54:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 10:54:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 153. [2024-11-07 10:54:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 131 states have internal predecessors, (183), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2024-11-07 10:54:07,696 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 167 [2024-11-07 10:54:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:07,697 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2024-11-07 10:54:07,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2024-11-07 10:54:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:07,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:07,701 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:07,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:54:07,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:07,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1352181279, now seen corresponding path program 1 times [2024-11-07 10:54:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:07,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257642549] [2024-11-07 10:54:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:11,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:11,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257642549] [2024-11-07 10:54:11,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257642549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:11,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:11,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:54:11,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968813114] [2024-11-07 10:54:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:11,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:54:11,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:11,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:54:11,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:54:11,456 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:13,699 INFO L93 Difference]: Finished difference Result 384 states and 553 transitions. [2024-11-07 10:54:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:54:13,700 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-07 10:54:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:13,701 INFO L225 Difference]: With dead ends: 384 [2024-11-07 10:54:13,701 INFO L226 Difference]: Without dead ends: 234 [2024-11-07 10:54:13,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:54:13,703 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 492 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:13,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 816 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 10:54:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-07 10:54:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 151. [2024-11-07 10:54:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2024-11-07 10:54:13,714 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 167 [2024-11-07 10:54:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:13,714 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2024-11-07 10:54:13,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2024-11-07 10:54:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:13,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:13,715 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:13,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:54:13,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:13,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1389290381, now seen corresponding path program 1 times [2024-11-07 10:54:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:13,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507575970] [2024-11-07 10:54:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507575970] [2024-11-07 10:54:15,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507575970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:15,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:15,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:54:15,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430031866] [2024-11-07 10:54:15,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:15,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:54:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:54:15,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:54:15,056 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:54:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:16,470 INFO L93 Difference]: Finished difference Result 352 states and 511 transitions. [2024-11-07 10:54:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:54:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2024-11-07 10:54:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:16,472 INFO L225 Difference]: With dead ends: 352 [2024-11-07 10:54:16,472 INFO L226 Difference]: Without dead ends: 204 [2024-11-07 10:54:16,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:54:16,473 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 298 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:16,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 947 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:54:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-07 10:54:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2024-11-07 10:54:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2024-11-07 10:54:16,498 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 167 [2024-11-07 10:54:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:16,498 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2024-11-07 10:54:16,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:54:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2024-11-07 10:54:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:16,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:16,501 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:54:16,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 802484367, now seen corresponding path program 1 times [2024-11-07 10:54:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510488435] [2024-11-07 10:54:16,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:19,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:19,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510488435] [2024-11-07 10:54:19,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510488435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:19,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:19,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:54:19,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570059733] [2024-11-07 10:54:19,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:19,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:54:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:19,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:54:19,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:54:19,753 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-07 10:54:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:21,125 INFO L93 Difference]: Finished difference Result 361 states and 526 transitions. [2024-11-07 10:54:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:54:21,125 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 167 [2024-11-07 10:54:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:21,127 INFO L225 Difference]: With dead ends: 361 [2024-11-07 10:54:21,127 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 10:54:21,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:54:21,128 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 329 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:21,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 643 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 10:54:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 10:54:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 162. [2024-11-07 10:54:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2024-11-07 10:54:21,138 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 167 [2024-11-07 10:54:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:21,139 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2024-11-07 10:54:21,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-07 10:54:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2024-11-07 10:54:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:21,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:21,140 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:21,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:54:21,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:21,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2001026907, now seen corresponding path program 1 times [2024-11-07 10:54:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062833902] [2024-11-07 10:54:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:25,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:25,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:25,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:25,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062833902] [2024-11-07 10:54:25,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062833902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:25,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:25,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 10:54:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19209019] [2024-11-07 10:54:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:25,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 10:54:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 10:54:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:54:25,131 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-07 10:54:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:26,456 INFO L93 Difference]: Finished difference Result 359 states and 524 transitions. [2024-11-07 10:54:26,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:54:26,457 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 6 states have call successors, (20) Word has length 167 [2024-11-07 10:54:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:26,458 INFO L225 Difference]: With dead ends: 359 [2024-11-07 10:54:26,458 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 10:54:26,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:54:26,459 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 589 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:26,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 512 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:54:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 10:54:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 164. [2024-11-07 10:54:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 240 transitions. [2024-11-07 10:54:26,470 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 240 transitions. Word has length 167 [2024-11-07 10:54:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:26,470 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 240 transitions. [2024-11-07 10:54:26,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-07 10:54:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 240 transitions. [2024-11-07 10:54:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:26,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:26,471 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:26,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:54:26,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:26,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1414220893, now seen corresponding path program 1 times [2024-11-07 10:54:26,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:26,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158870661] [2024-11-07 10:54:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:26,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:28,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158870661] [2024-11-07 10:54:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158870661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:54:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471894968] [2024-11-07 10:54:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:54:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:28,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:54:28,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:54:28,649 INFO L87 Difference]: Start difference. First operand 164 states and 240 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:29,844 INFO L93 Difference]: Finished difference Result 361 states and 525 transitions. [2024-11-07 10:54:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:54:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-07 10:54:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:29,849 INFO L225 Difference]: With dead ends: 361 [2024-11-07 10:54:29,850 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 10:54:29,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:54:29,851 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 228 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:29,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 929 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:54:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 10:54:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 162. [2024-11-07 10:54:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2024-11-07 10:54:29,861 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 167 [2024-11-07 10:54:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:29,862 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2024-11-07 10:54:29,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2024-11-07 10:54:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:29,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:29,863 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:29,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:54:29,863 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:29,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1451329995, now seen corresponding path program 1 times [2024-11-07 10:54:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:29,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64740907] [2024-11-07 10:54:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64740907] [2024-11-07 10:54:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64740907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:54:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756320707] [2024-11-07 10:54:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:30,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:54:30,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:54:30,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:54:30,993 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:31,636 INFO L93 Difference]: Finished difference Result 321 states and 473 transitions. [2024-11-07 10:54:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:54:31,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-07 10:54:31,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:31,639 INFO L225 Difference]: With dead ends: 321 [2024-11-07 10:54:31,639 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 10:54:31,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:54:31,640 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 132 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:31,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 446 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:54:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 10:54:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-07 10:54:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2024-11-07 10:54:31,653 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 167 [2024-11-07 10:54:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:31,654 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2024-11-07 10:54:31,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-11-07 10:54:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:31,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:31,655 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:31,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:54:31,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:31,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash -354108339, now seen corresponding path program 1 times [2024-11-07 10:54:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325138909] [2024-11-07 10:54:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:36,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325138909] [2024-11-07 10:54:36,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325138909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:36,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:36,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:54:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445393192] [2024-11-07 10:54:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:36,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:54:36,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:54:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:54:36,192 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-07 10:54:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:37,728 INFO L93 Difference]: Finished difference Result 361 states and 524 transitions. [2024-11-07 10:54:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:54:37,729 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 167 [2024-11-07 10:54:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:37,730 INFO L225 Difference]: With dead ends: 361 [2024-11-07 10:54:37,731 INFO L226 Difference]: Without dead ends: 202 [2024-11-07 10:54:37,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:54:37,732 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 497 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:37,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 607 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:54:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-07 10:54:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2024-11-07 10:54:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.4014084507042253) internal successors, (199), 142 states have internal predecessors, (199), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 239 transitions. [2024-11-07 10:54:37,756 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 239 transitions. Word has length 167 [2024-11-07 10:54:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:37,757 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 239 transitions. [2024-11-07 10:54:37,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-07 10:54:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 239 transitions. [2024-11-07 10:54:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:54:37,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:37,758 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:37,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:54:37,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash -940914353, now seen corresponding path program 1 times [2024-11-07 10:54:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987448246] [2024-11-07 10:54:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987448246] [2024-11-07 10:54:39,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987448246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:39,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:54:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853194710] [2024-11-07 10:54:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:39,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:54:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:39,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:54:39,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:54:39,985 INFO L87 Difference]: Start difference. First operand 164 states and 239 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:41,460 INFO L93 Difference]: Finished difference Result 363 states and 525 transitions. [2024-11-07 10:54:41,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:54:41,460 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-07 10:54:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:41,461 INFO L225 Difference]: With dead ends: 363 [2024-11-07 10:54:41,461 INFO L226 Difference]: Without dead ends: 202 [2024-11-07 10:54:41,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:54:41,462 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 177 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:41,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 999 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:54:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-07 10:54:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2024-11-07 10:54:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:54:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2024-11-07 10:54:41,474 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 167 [2024-11-07 10:54:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:41,474 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2024-11-07 10:54:41,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-11-07 10:54:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:54:41,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:41,475 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:41,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:54:41,476 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:41,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash 107651391, now seen corresponding path program 1 times [2024-11-07 10:54:41,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:41,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984204734] [2024-11-07 10:54:41,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:41,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:54:42,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:42,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984204734] [2024-11-07 10:54:42,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984204734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:42,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:42,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:54:42,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002956538] [2024-11-07 10:54:42,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:42,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:54:42,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:42,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:54:42,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:54:42,370 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:43,388 INFO L93 Difference]: Finished difference Result 476 states and 686 transitions. [2024-11-07 10:54:43,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 10:54:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 169 [2024-11-07 10:54:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:43,390 INFO L225 Difference]: With dead ends: 476 [2024-11-07 10:54:43,390 INFO L226 Difference]: Without dead ends: 317 [2024-11-07 10:54:43,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:54:43,391 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 624 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:43,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 914 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:54:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-07 10:54:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 272. [2024-11-07 10:54:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 231 states have (on average 1.380952380952381) internal successors, (319), 232 states have internal predecessors, (319), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:54:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 395 transitions. [2024-11-07 10:54:43,411 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 395 transitions. Word has length 169 [2024-11-07 10:54:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:43,411 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 395 transitions. [2024-11-07 10:54:43,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:54:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 395 transitions. [2024-11-07 10:54:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:54:43,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:43,412 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:43,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 10:54:43,412 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:43,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash 530353217, now seen corresponding path program 1 times [2024-11-07 10:54:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114991640] [2024-11-07 10:54:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:54:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:54:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:54:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:54:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:54:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:54:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:54:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:54:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:54:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:54:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:54:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:54:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:54:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:54:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:54:43,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:43,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114991640] [2024-11-07 10:54:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114991640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:43,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:43,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:54:43,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705013638] [2024-11-07 10:54:43,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:43,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:54:43,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:43,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:54:43,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:54:43,491 INFO L87 Difference]: Start difference. First operand 272 states and 395 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:54:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:43,525 INFO L93 Difference]: Finished difference Result 545 states and 795 transitions. [2024-11-07 10:54:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:54:43,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-07 10:54:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:43,529 INFO L225 Difference]: With dead ends: 545 [2024-11-07 10:54:43,529 INFO L226 Difference]: Without dead ends: 276 [2024-11-07 10:54:43,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:54:43,530 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:43,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:54:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-07 10:54:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-07 10:54:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 235 states have (on average 1.374468085106383) internal successors, (323), 236 states have internal predecessors, (323), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:54:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 399 transitions. [2024-11-07 10:54:43,550 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 399 transitions. Word has length 169 [2024-11-07 10:54:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:43,552 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 399 transitions. [2024-11-07 10:54:43,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:54:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 399 transitions. [2024-11-07 10:54:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:54:43,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:43,553 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:43,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 10:54:43,554 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash 749207935, now seen corresponding path program 1 times [2024-11-07 10:54:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:43,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079930011] [2024-11-07 10:54:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:54:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320287978] [2024-11-07 10:54:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:54:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:54:43,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:54:43,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:54:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:54:44,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:54:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:54:45,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:54:45,631 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:54:45,632 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:54:45,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:54:45,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:54:45,838 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:54:46,016 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:54:46,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:54:46 BoogieIcfgContainer [2024-11-07 10:54:46,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:54:46,022 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:54:46,022 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:54:46,022 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:54:46,023 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:37" (3/4) ... [2024-11-07 10:54:46,025 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:54:46,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:54:46,026 INFO L158 Benchmark]: Toolchain (without parser) took 69806.32ms. Allocated memory was 117.4MB in the beginning and 981.5MB in the end (delta: 864.0MB). Free memory was 92.4MB in the beginning and 648.7MB in the end (delta: -556.3MB). Peak memory consumption was 310.8MB. Max. memory is 16.1GB. [2024-11-07 10:54:46,026 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:54:46,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.61ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:54:46,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.85ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 72.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:54:46,026 INFO L158 Benchmark]: Boogie Preprocessor took 68.39ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 69.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:54:46,027 INFO L158 Benchmark]: RCFGBuilder took 1197.49ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 76.2MB in the end (delta: -7.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-11-07 10:54:46,027 INFO L158 Benchmark]: TraceAbstraction took 68042.40ms. Allocated memory was 117.4MB in the beginning and 981.5MB in the end (delta: 864.0MB). Free memory was 75.8MB in the beginning and 649.0MB in the end (delta: -573.2MB). Peak memory consumption was 288.4MB. Max. memory is 16.1GB. [2024-11-07 10:54:46,027 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 981.5MB. Free memory was 649.0MB in the beginning and 648.7MB in the end (delta: 258.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:54:46,028 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.16ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.61ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.85ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 72.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.39ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 69.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1197.49ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 76.2MB in the end (delta: -7.1MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 68042.40ms. Allocated memory was 117.4MB in the beginning and 981.5MB in the end (delta: 864.0MB). Free memory was 75.8MB in the beginning and 649.0MB in the end (delta: -573.2MB). Peak memory consumption was 288.4MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 981.5MB. Free memory was 649.0MB in the beginning and 648.7MB in the end (delta: 258.9kB). Peak memory consumption was 8.4MB. 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 137. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L61] unsigned long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L62] unsigned long int* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L63] unsigned long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L64] unsigned long int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L65] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L66] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L67] float* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L68] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L69] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L70] unsigned long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L71] unsigned long int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L72] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L73] unsigned long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L74] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L75] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L76] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L77] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=0] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L101] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L102] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L104] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L108] EXPR WrapperStruct00.var_1_5 [L108] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_5 [L108] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L109] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L110] EXPR WrapperStruct00.var_1_6 [L110] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_6 [L110] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L110] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L112] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_7 [L113] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_7 [L113] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_8 [L115] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_8 [L115] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L116] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L118] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L119] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L121] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L122] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L124] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L125] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L127] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L129] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L130] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L131] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L132] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L145] RET updateVariables() [L146] CALL step() [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L81] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L81] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L81] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) [L82] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L82] COND FALSE !(((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) [L85] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L85] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))) [L85] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L85] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L85] (*(WrapperStruct00_var_1_10_Pointer)) = (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))))) [L86] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L86] unsigned char stepLocal_0 = (- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f; [L87] stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L87] stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L87] COND FALSE !(stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) [L90] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L90] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L92] COND FALSE !((*(WrapperStruct00_var_1_18_Pointer))) [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) [L137] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1 [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f) || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137-L138] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f) || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer))))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.8s, OverallIterations: 20, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6238 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6223 mSDsluCounter, 12982 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10349 mSDsCounter, 537 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13097 IncrementalHoareTripleChecker+Invalid, 13634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 537 mSolverCounterUnsat, 2633 mSDtfsCounter, 13097 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 981 SyntacticMatches, 4 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=19, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 644 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 3501 NumberOfCodeBlocks, 3501 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3144 ConstructedInterpolants, 0 QuantifiedInterpolants, 52977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 14440/14440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:54:46,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.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 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:54:48,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:54:48,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:54:48,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:54:48,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:54:48,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:54:48,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:54:48,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:54:48,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:54:48,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:54:48,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:54:48,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:54:48,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:54:48,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:54:48,486 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:54:48,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:54:48,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:54:48,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:54:48,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:54:48,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:54:48,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:54:48,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:54:48,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:54:48,489 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:54:48,489 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:54:48,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:54:48,489 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:54:48,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:54:48,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:54:48,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:54:48,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:54:48,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:54:48,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:54:48,491 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 -> 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 [2024-11-07 10:54:48,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:54:48,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:54:48,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:54:48,760 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:54:48,761 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:54:48,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-07 10:54:50,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:54:50,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:54:50,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-07 10:54:50,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b9a0aa29/40b2bc6308234b439d0a3dfcd46f5045/FLAG132af9c85 [2024-11-07 10:54:50,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b9a0aa29/40b2bc6308234b439d0a3dfcd46f5045 [2024-11-07 10:54:50,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:54:50,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:54:50,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:54:50,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:54:50,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:54:50,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bebc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50, skipping insertion in model container [2024-11-07 10:54:50,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:54:50,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2024-11-07 10:54:50,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:54:50,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:54:50,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2024-11-07 10:54:50,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:54:50,562 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:54:50,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50 WrapperNode [2024-11-07 10:54:50,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:54:50,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:54:50,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:54:50,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:54:50,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,630 INFO L138 Inliner]: procedures = 34, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 553 [2024-11-07 10:54:50,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:54:50,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:54:50,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:54:50,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:54:50,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,694 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-07 10:54:50,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:54:50,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:54:50,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:54:50,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:54:50,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:50" (1/1) ... [2024-11-07 10:54:50,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:54:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:54:50,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:54:50,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:54:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:54:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:54:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:54:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:54:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:54:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:54:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:54:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:54:50,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:54:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:54:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:54:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:54:50,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:54:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:54:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:54:50,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:54:50,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:54:50,917 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:54:50,919 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation